Context–free grammar induction using evolutionary methods
نویسنده
چکیده
The research into the ability of building self-learning natural language parser based on context–free grammar (CFG ) was presented. The paper investigates the use of evolutionary methods: a genetic algorithm, a genetic programming and learning classifier systems for inferring CFG based parser. The experiments were conducted on the real set of natural language sentences. The gained results confirm the feasibility of applying evolutionary algorithms for context-free grammatical inference. Key-words: Grammatical inference, context–free grammars, natural language processing, evolutionary computation
منابع مشابه
Learning Classifier System Approach to Natural Language Grammar Induction
This paper describes an evolutionary approach to the problem of inferring non-stochastic context-free grammar (CFG) from natural language (NL) corpora. The approach employs Grammar-based Classifier System (GCS). GCS is a new version of Learning Classifier Systems in which classifiers are represented by CFG in Chomsky Normal Form. GCS has been tested on the NL corpora, and it provided comparable...
متن کاملFuzzy Grammar-based Prediction of Amyloidogenic Regions
In this paper, we address the problem of predicting the location of amyloidogenic regions in proteins. The language of protein sequence can be described by using a formal system such as fuzzy context-free grammar, and the problem of amyloidogenic region recognition can be replaced by fuzzy grammar induction. The induced fuzzy grammar achieved 70.6% accuracy and 96.7% specificity on a recently p...
متن کاملExamining Mutation Landscapes in Grammar Based Genetic Programming
Representation is a very important component of any evolutionary algorithm. Changing the representation can cause an algorithm to perform very differently. Such a change can have an effect that is difficult to understand. This paper examines what happens to the grammatical evolution algorithm when replacing the commonly used context-free grammar representation with a tree-adjunct grammar repres...
متن کاملeg-GRIDS: Context-Free Grammatical Inference from Positive Examples Using Genetic Search
In this paper we present eg-GRIDS, an algorithm for inducing context-free grammars that is able to learn from positive sample sentences. The presented algorithm, similar to its GRIDS predecessors, uses simplicity as a criterion for directing inference, and a set of operators for exploring the search space. In addition to the basic beam search strategy of GRIDS, eg-GRIDS incorporates an evolutio...
متن کاملBayesian Grammar Induction for Language Modeling
We describe a corpus-based induction algorithm for probabilistic context-free grammars. The algorithm employs a greedy heuristic search within a Bayesian framework, and a post-pass using the InsideOutside algorithm. We compare the performance of our algorithm to n-gram models and the Inside-Outside algorithm in three language modeling tasks. In two of the tasks, the training data is generated b...
متن کامل